Robustness of regional matching scheme over global matching scheme
نویسندگان
چکیده
منابع مشابه
Robustness of Regional Matching Scheme over Global Matching Scheme
The paper has established and veri ed the theory prevailing widely among image and pattern recognition specialists that the bottom-up indirect regional matching process is the more stable and the more robust than the global matching process against concentrated types of noise represented by clutter, outlier or occlusion in the imagery. We have demonstrated this by analyzing the e ect of concent...
متن کاملTexture Comparison with an Orientation Matching Scheme
Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily ...
متن کاملA Progressive Scheme for Stereo Matching
Brute-force dense matching is usually not satisfactory because the same search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progressive scheme for stereo matching which uses two fundamental concepts: the disparity gradient limit principle and the least commitment strategy. The first states that the disparity should vary smoothly almost...
متن کاملSoft-SCS: Improving the Security and Robustness of the Scalar-Costa-Scheme by Optimal Distribution Matching
In this paper we propose an extension of the Scalar-CostaScheme (SCS), called Soft-SCS, which offers better or equal achievable rates than SCS for the AWGN channel. After recalling the principle of SCS we highlight its secure implementations regarding the Watermarked contents Only Attack, and we also describe the relations between the alphabet size and the secure embedding parameters. Since the...
متن کاملOn Matching Robustness
We introduce the notion of robustness of the minimum-weight perfect matching. The robustness measures how much the edge weights of a graph are allowed to change before the minimum-weight matching changes. We consider two cases: when the edge weights are changed adversarially and when they are changed randomly. We provide algorithms for computing the robustness in both cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(02)00366-1